def ff(g,n):
    s=0
    while g>0:
        if g%n==8:
            s+=1
        g=g//n
    return s
f = {}
x = 39*15**64+35**450+74*43**121-450035
for i in range(2,200):
   f[ff(x,i)]=i
print(sorted(f.items()))
